A new orthogonalization procedure with an extremal property
نویسندگان
چکیده
Various methods of constructing an orthonomal set out of a given set of linearly independent vectors are discussed. Particular attention is paid to the Gram-Schmidt and the Schweinler-Wigner orthogonalization procedures. A new orthogonalization procedure which, like the SchweinlerWigner procedure, is democratic and is endowed with an extremal property is suggested. PACS No: 02.10.Sp, 31.15.+q e-mail:[email protected] email:[email protected] e-mail:[email protected] 1 Constructing an orthonormal set out of a given set of linearly independent Vectors is an age old problem. Among the many possible orthogonalization procedures, the two algorithmic procedures that have been extensively discussed and used in the literature are (a) the familiar Gram-Schmidt procedure [1] and (b) a procedure which is referred to as the Schweinler -Wigner procedure [2], particularly in the wavelet literature [3]. ( This method is known among the chemists as the Löwdin orthogonalization procedure [4]. Mathematicians attribute it to Poincaré. Schweinler and Wigner themselves trace its origin to a work of Landshoff [5]. Eschewing the question of historically correct attribution, we shall continue to refer to it as the Schweinler-Wigner procedure ) An intrinsic difference between the two procedures is that while the Gram-Schmidt procedure, by its very nature, requires one to select the linearly independent vectors sequentially, the Schweinler-Wigner procedures treats all the members of the set of linearly independent vectors democratically. The significance of the work of Schweinler and Wigner lies not in introducing a new orthogonalization method the method was already known but rather in introducing a positive quantity m, to be defined shortly, which discriminates between various orthogonalization procedures. They showed that m is a maximum for the Schweinler-Wigner basis. In this letter we pose and answer the question as to what is the orthogonalization procedure which minimizes m. This new orthogonalization procedure, like the Schweinler-Wigner procedure, also turns out to be completely democratic in that it treats all the linearly independent vectors on the same footing. The quantity m was introduced by Schweinler and Wigner in a some what ad-hoc manner. We reformulate their procedure in a way so as that the quantity m appears in a natural way and can be useful in a wider context than that for which it was introduced. In particular, this reformulation enables us to quantify the notion of an orthonormal basis which brings any Hermitian operator in to a maximally off-diagonal form. Let v1, · · · , vN denote a set of N linearly independent vectors. Let M denote the associated Gram matrix :Mij = (vi, vj). M is a positive definite Hermitian matrix. Define z = vS , (1)
منابع مشابه
On Orthogonalization Approach to Construct a Multiple Input Transfer Function Model
In this article, a special type of orthogonalization is obtained to construct a multiple input transfer function model. By using this technique, construction of a transfer function model is divided to sequential construction of transfer function models with less input time series. Furthermore, based on real and simulated time series we provide an instruction to adequately perform the stages of ...
متن کاملProperty Pd, m and efficient design of reliable networks
For d ≥ 1 and m ≥ 1, a graph has property Pd ,m if there exist at least m vertex-disjoint paths of length at most d between each pair of vertices. Property Pd ,m , which has a strong connection to wide diameter, is one way of measuring the reliability of a network. In this article, we first examine the relationship of Pd ,m to other similar properties and then we prove several results regarding...
متن کاملCholesky-Like Factorization of Symmetric Indefinite Matrices and Orthogonalization with Respect to Bilinear Forms
It is well-known that orthogonalization of column vectors in a rectangular matrix B with respect to the bilinear form induced by a nonsingular symmetric indefinite matrix A can be seen as its factorization B = QR that is equivalent to the Cholesky-like factorization in the form BTAB = RTΩR, where Ω is some signature matrix. Under the assumption of nonzero principal minors of the matrix M = BTAB...
متن کاملAn efficient conjugate direction method with orthogonalization for large-scale quadratic optimization problems
A new conjugate direction method is proposed, which is based on an orthogonalization procedure and does not make use of line searches for the conjugate vector set construction. This procedure prevents the set of conjugate vectors from degeneracy and eliminates high sensitivity to computation errors pertinent to methods of conjugate directions, resulting in an efficient algorithm for solving lar...
متن کاملStructure and Enumeration Theorems for Hereditary Properties in Finite Relational Languages
Given a finite relational language L, a hereditary L-property is a class of finite Lstructures which is closed under isomorphism and model theoretic substructure. This notion encompasses many objects of study in extremal combinatorics, including (but not limited to) hereditary properties of graphs, hypergraphs, and oriented graphs. In this paper, we generalize certain definitions, tools, and re...
متن کامل